منابع مشابه
A Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولA Curious Connection Between Branching Processes and Optimal Stopping
A curious connection exists between the theory of optimal stopping for independent random variables, and branching processes. In particular, for the branching process Zn with o spring distribution Y , there exists a random variable X such that the probability P (Zn = 0) of extinction of the nth generation in the branching process equals the value obtained by optimally stopping the sequence X1; ...
متن کاملA Curious Connection Between Optimal Stopping and Branching Processes
A curious connection exists between the theory of branching processes and optimal stopping for independent random variables. For the branching process Zn with offspring distribution Y , there exists a random variable X such that the probability P (Zn = 0) of extinction of the n generation in the branching process equals the value obtained by optimally stopping the independent sequence X1, . . ....
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2005
ISSN: 0028-0836,1476-4687
DOI: 10.1038/435750a